Computing the k-error 2-adic complexity of a binary sequence of period p
نویسندگان
چکیده
Cryptographically strong sequences should have a large 2-adic complexity to thwart the known feedback with carry shift register (FCSR) synthesis algorithms. At the same time the change of a few terms should not cause a significant decrease of the 2-adic complexity. This requirement leads to the concept of the k-error 2-adic complexity. In this paper, an algorithm for computing the k-error 2-adic complexity of the binary sequence with period N=p, p is a prime, is proposed by using the 2-adic complexity synthesis algorithm of Wilfried Meidl, and the Stamp-Martin algorithm. This algorithm is the first concrete construction of the algorithm for calculating the k-error 2-adic complexity. Using the algorithm proposed, the upper bound of the k-error 2-adic complexity can be obtained in n steps.
منابع مشابه
An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2p
An efficient algorithm is presented for computing the kerror linear complexity of a binary sequence with period 2p, where 2 is a primitive root modulo p. The new algorithm is a generalization of an algorithm for computing the k-error linear complexity of a binary sequence with period p presented by Wei, Chen, and Xiao.
متن کامل2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period
In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The results show the variation of the distribution of the 2-adic complexity becomes as increases. Particularly, we discuss the lower bounds when respectively. k (2) GF
متن کاملOn the distinctness of binary sequences derived from $2$-adic expansion of m-sequences over finite prime fields
Let p be an odd prime with 2-adic expansion ∑k i=0 pi · 2 . For a sequence a = (a(t))t≥0 over Fp, each a(t) belongs to {0, 1, . . . , p − 1} and has a unique 2-adic expansion a(t) = a0(t) + a1(t) · 2 + · · ·+ ak(t) · 2 , with ai(t) ∈ {0, 1}. Let ai denote the binary sequence (ai(t))t≥0 for 0 ≤ i ≤ k. Assume i0 is the smallest index i such that pi = 0 and a and b are two different m-sequences ge...
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملOn the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory
The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and k-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable k-error linear complexity is proposed to study sequences with stable and large k-error linear complexity...
متن کامل